Regularized maximum likelihood estimation of sparse stochastic monomolecular biochemical reaction networks

نویسندگان

  • Hong Jang
  • Kwang Ki Kevin Kim
  • Richard D. Braatz
  • R. Bhushan Gopaluni
  • Jay H. Lee
چکیده

A sparse parameter estimation method is proposed for identifying a stochastic monomolecular biochemical reaction network system. Identification of a reaction network can be achieved by estimating a sparse parameter matrix containing the reaction network structure and kinetics information. Stochastic dynamics of a biochemical reaction network system is usually modeled by a chemical master equation, which is composed of several ordinary differential equations describing the time evolution of probability distributions for all possible states. This paper considers closed monomolecular reaction systems for which an exact analytical solution of the corresponding chemical master equation is available. The estimation method presented in this paper incorporates the closed-form solution into a regularized maximum likelihood estimation (MLE) for which model complexity is penalized, whereas most of existing studies on sparse reaction network identification use deterministic models for regularized leastsquare estimation. A simulation result is provided to verify performance improvement of the presented regularized MLE over the least squares (LSE) based on a deterministic mass-average model in the case of a small population size. Improved reaction structure detection is achieved by adding a penalty term for l1 regularization to the exact maximum likelihood function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limitation and averaging for deterministic and stochastic biochemical reaction networks

We discuss model reduction of multiscale networks of biochemical reactions used in systems biology as models for cell physiology and pathology. For linear kinetic models, which appear as ”pseudo-monomolecular” subsystems of the nonlinear reaction networks, we obtain a general reduction algorithm based on cycle averaging and surgery. The same algorithm, when applied to stochastic networks, allow...

متن کامل

Learning Sparse Gaussian Graphical Model with l0-regularization

For the problem of learning sparse Gaussian graphical models, it is desirable to obtain both sparse structures as well as good parameter estimates. Classical techniques, such as optimizing the l1-regularized maximum likelihood or Chow-Liu algorithm, either focus on parameter estimation or constrain to specific structure. This paper proposes an alternative that is based on l0-regularized maximum...

متن کامل

The Highest Dimensional Stochastic Blockmodel with a Regularized Estimator

This paper advances the high dimensional frontier for network clustering. In the high dimensional Stochastic Blockmodel for a random network, the number of clusters (or blocks) K grows with the number of nodes N . Previous authors have studied the statistical estimation performance of spectral clustering and the maximum likelihood estimator under the high dimensional model. These authors do not...

متن کامل

Simulated maximum likelihood method for estimating kinetic rates in gene expression

MOTIVATION Kinetic rate in gene expression is a key measurement of the stability of gene products and gives important information for the reconstruction of genetic regulatory networks. Recent developments in experimental technologies have made it possible to measure the numbers of transcripts and protein molecules in single cells. Although estimation methods based on deterministic models have b...

متن کامل

ITERATIVE THRESHOLDING ALGORITHM FOR SPARSE INVERSE COVARIANCE ESTIMATION By

The `1-regularized maximum likelihood estimation problem has recently become a topic of great interest within the machine learning, statistics, and optimization communities as a method for producing sparse inverse covariance estimators. In this paper, a proximal gradient method (G-ISTA) for performing `1-regularized covariance matrix estimation is presented. Although numerous algorithms have be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Chemical Engineering

دوره 90  شماره 

صفحات  -

تاریخ انتشار 2016